منابع مشابه
Bounds on System Reliability by Linear Programming
Bounds on system probability in terms of marginal or joint component probabilities are of interest when exact solutions cannot be obtained. Currently, bounding formulas employing unicomponent probabilities are available for series and parallel systems, and formulas employing biand higher-order component probabilities are available for series systems. No theoretical formulas exist for general sy...
متن کاملLower System Reliability Bounds from Binary Failure Data Using Bootstrapping
W E CONSIDER the problem of determining a (1 − α)100% lower confidence bound on the system reliability for a coherent system of k components using the failure data (yi, ni), where yi is the number of components of type i that pass the test and ni is the number of components of type i on test, i = 1, 2, . . . , k. We assume throughout that the components fail independently, e.g., no commoncause ...
متن کاملLower Bounds for Two-Terminal Network Reliability
One measure of two-terminal network reliability, termed probabilistic connectedness, is the probability that two specified communication centers can communicate. A standard model of a network is a graph in which nodes represent communications centers and edges represent links between communication centers. Edges are assumed to have statistically independent probabilities of failing and nodes ar...
متن کاملGeneralized Reliability Bounds for Coherent Structures
In this article we introduce generalizations of several well known reliability bounds. These bounds are based on arbitrary partitions of the family of minimal path or cut sets of the system and can be used for approximating the reliability of any coherent structure with iid components. An illustration is also given of how the general results can be applied for a specific reliability structure (...
متن کاملNon-Stanley Bounds for Network Reliability
Suppose that each edge of a connected graph G of order n is independently operational with probability p; the reliability of G is the probability that the operational edges form a spanning connected subgraph. A useful expansion of the reliability is as pn-1 5dj=0 Hi(l — p ) i , and the Ball-Provan method for bounding reliability relies on Stanley's combinatorial bounds for the H-vectors of shel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Structural and Construction Engineering (Transactions of AIJ)
سال: 2001
ISSN: 1340-4202,1881-8153
DOI: 10.3130/aijs.66.43_4